- finite-state acceptor
- конечный автомат
Англо-русский словарь промышленной и научной лексики. 2014.
finite-state acceptor
Смотреть что такое "finite-state acceptor" в других словарях:
Finite state transducer — A finite state transducer (FST) is a finite state machine with two tapes: an input tape and an output tape. This contrasts with an ordinary finite state automaton (or finite state acceptor), which has a single tape. OverviewAn automaton can be… … Wikipedia
Finite-state machine — State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… … Wikipedia
Finite state machine — A finite state machine (FSM) or finite state automaton (plural: automata ) or simply a state machine, is a model of behavior composed of a finite number of states, transitions between those states, and actions. A finite state machine is an… … Wikipedia
State diagram — State diagrams is a diagram used in the field of computer science, representing the behavior of a system, which is composed of a finite number of states. There are many forms of state diagrams, which differ slightly and have different semantics.… … Wikipedia
Acceptor — may refer to: * Acceptor (accounting), the addressee of a bill of exchange. * In the Indian Contract Act of 1872, the acceptor is the person to whom a proposal is made, and who has communicated his or her acceptance of the said proposal. * In… … Wikipedia
automata theory — Body of physical and logical principles underlying the operation of any electromechanical device (an automaton) that converts information input in one form into another, or into some action, according to an algorithm. Norbert Wiener and Alan M.… … Universalium
Abstract family of acceptors — An abstract family of acceptors (AFA) is a grouping of generalized acceptors. Informally, an acceptor is a device with a finite state control, a finite number of input symbols, and an internal store with a read and write function. Each acceptor… … Wikipedia
Automatic group — In mathematics, an automatic group is a finitely generated group equipped with several finite state automata. These automata can tell if a given word representation of a group element is in a canonical form and can tell if two elements given in… … Wikipedia
Pattern theory — Pattern theory, formulated by Ulf Grenander, is a mathematical formalism to describe knowledge of the world as patterns. It differs from other approaches to artificial intelligence in that it does not begin by prescribing algorithms and machinery … Wikipedia
Charge ordering — (CO) is a (first or second order) phase transition occurring mostly in strongly correlated materials such as transition metal oxides or organic conductors. Due to the strong interaction, the charge is localized on different sites leading to a… … Wikipedia
semiconductor device — ▪ electronics Introduction electronic circuit component made from a material that is neither a good conductor nor a good insulator (hence semiconductor). Such devices have found wide applications because of their compactness, reliability,… … Universalium
